#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n;cin>>n;
        for(LL i=1;i<=n;i++) cin>>a[i];
        sort(a+1,a+1+n);
        if(n==1){
            cout<<1<<"\n";
            continue;
        }
        LL minval=a[2]-a[1];
        LL ans=1;
        for(LL i=2;i<=n;i++){
            minval=min(minval,abs(a[i]-a[i-1]));
            if(minval>=a[i]){
               ans++;
            }
        }
        cout<<max((LL)1,ans)<<"\n";
    }
   	return 0;
}
